A new lower bound for one-machine earliness-tardiness scheduling
نویسنده
چکیده
In one-machine scheduling, MIP time-indexed formulations are often used to provide very good lower bounds through Lagrangian relaxations. In order to get an improved lower bound, we add valid cuts to a time-indexed formulation and show we still have a Lagrangian relaxation that can be solved as a shortest path in a graph. Two branch-and-bound algorithms are then presented for the earliness-tardiness scheduling problem with either common or general due dates. In both cases, our algorithms outperform the previously published approaches.
منابع مشابه
Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملImproved Lower Bounds for the Single Machine Earliness/Tardiness Scheduling Problem with Release Dates
⎯In this paper, we consider the single machine earliness/tardiness scheduling problem with different release dates and no unforced idle time. The most effective lower bound uses multiplier adjustment procedures that require an initial sequence. We investigate the sensitivity of the lower bounding procedure to the initial sequences, and experiment with different scheduling rules and dominance co...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملAn efficient algorithm for the earliness-tardiness scheduling problem
This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.
متن کامل